1

Preface to Special Issue on Algorithms and Complexity

Year:
2019
Language:
english
File:
PDF, 136 KB
english, 2019
13

The probabilistic longest path problem

Year:
1999
Language:
english
File:
PDF, 141 KB
english, 1999
17

Efficient algorithms for themax

Year:
2014
Language:
english
File:
PDF, 320 KB
english, 2014
19

When polynomial approximation meets exact computation

Year:
2018
Language:
english
File:
PDF, 558 KB
english, 2018
23

A survey of approximately optimal solutions to some covering and packing problems

Year:
1997
Language:
english
File:
PDF, 596 KB
english, 1997
31

The probabilistic minimum dominating set problem

Year:
2016
Language:
english
File:
PDF, 628 KB
english, 2016
42

A survey on the structure of approximation classes

Year:
2010
Language:
english
File:
PDF, 2.99 MB
english, 2010
43

Parameterized (in)approximability of subset problems

Year:
2014
Language:
english
File:
PDF, 380 KB
english, 2014
46

Fast reoptimization for the minimum spanning tree problem

Year:
2010
Language:
english
File:
PDF, 457 KB
english, 2010
47

On-line vertex-covering

Year:
2005
Language:
english
File:
PDF, 340 KB
english, 2005